@article{demaine2007dynamic,
  title={Dynamic optimality—almost},
  author={Demaine, Erik D and Harmon, Dion and Iacono, John and P a ˇ tra{\c{s}}cu, Mihai},
  journal={SIAM Journal on Computing},
  volume={37},
  number={1},
  pages={240--251},
  year={2007},
  publisher={SIAM},
  url={http://erikdemaine.org/papers/Tango_SICOMP/}
}
@inproceedings{daniel2006log,
  title={O (log log n)-competitive dynamic binary search trees},
  author={Wang, Chengwen Chris and Derryberry, Jonathan and Sleator, Daniel D},
  booktitle={Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms},
  volume={122},
  pages={374},
  year={2006},
  organization={SIAM},
  url={https://www.cs.cmu.edu/~jonderry/multi-splay.pdf}
}
@article{sleator2004dynamic,
  title={Dynamic optimality and multi-splay trees},
  author={Sleator, Daniel D and Wang, Chengwen Chris},
  year={2004},
  publisher={Carnegie Mellon University},
  url={https://kilthub.cmu.edu/ndownloader/files/12095432}
}
@article{derryberry2009properties,
  title={Properties of multi-splay trees},
  author={Derryberry, Jonathan and Sleator, Daniel and Wang, Chengwen Chris},
  publisher={Carnegie Mellon University},
  year={2009},
  url={http://reports-archive.adm.cs.cmu.edu/anon/2009/CMU-CS-09-171.pdf}
}
@article{sleator1985self,
  title={Self-adjusting binary search trees},
  author={Sleator, Daniel D and Tarjan, Robert E},
  journal={Journal of the ACM (JACM)},
  volume={32},
  number={3},
  pages={652--686},
  year={1985},
  publisher={ACM New York, NY, USA},
  url={https://dl.acm.org/doi/pdf/10.1145/3828.3835}
}
@book{cormen2009introduction,
  title={Introduction to Algorithms},
  author={Cormen, Thomas H and Leiserson, Charles E and Rivest, Ronald L and Stein, Clifford},
  year={2009},
  publisher={MIT Press}
}
@techreport{wein2005efficient,
  title={Efficient implementation of red-black trees with split and catenate operations},
  author={Wein, Ron},
  year={2005},
  institution={Tel Aviv University},
  url={http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.109.4875&rep=rep1&type=pdf}
}
@misc{wiki:rb,
   author = "{Wikipedia contributors}",
   title = "Red-black tree --- {W}ikipedia{,} The Free Encyclopedia",
   year = "2021",
   url = "https://en.wikipedia.org/wiki/Red-black_tree",
   note = "[Online; accessed 2021-05-19]"
}
@book{sedgewick1990algorithms,
  title={Algorithms in C},
  author={Sedgewick, Robert},
  year={1990},
  publisher={Addison-Wesley}
}
@book{okasaki1999purely,
  title={Purely Functional Data Structures},
  author={Okasaki, Chris},
  year={1999},
  publisher={Cambridge University Press}
}
@article{wilber1989lower,
  title={Lower bounds for accessing binary search trees with rotations},
  author={Wilber, Robert},
  journal={SIAM journal on Computing},
  volume={18},
  number={1},
  pages={56--67},
  year={1989},
  publisher={SIAM},
  url={https://epubs.siam.org/doi/pdf/10.1137/0218004}
}
@book{tarjan1983data,
  title={Data Structures and Network Algorithms},
  author={Tarjan, Robert E},
  year={1983},
  publisher={SIAM}
}
@article{tarjan1985sequential,
  title={Sequential access in splay trees takes linear time},
  author={Tarjan, Robert E},
  journal={Combinatorica},
  volume={5},
  number={4},
  pages={367--378},
  year={1985},
  publisher={Springer}
}